Exploring peptide/MHC detachment processes using hierarchical natural move Monte Carlo
نویسندگان
چکیده
منابع مشابه
Exploring peptide/MHC detachment processes using hierarchical natural move Monte Carlo
MOTIVATION The binding between a peptide and a major histocompatibility complex (MHC) is one of the most important processes for the induction of an adaptive immune response. Many algorithms have been developed to predict peptide/MHC (pMHC) binding. However, no approach has yet been able to give structural insight into how peptides detach from the MHC. RESULTS In this study, we used a combina...
متن کاملHierarchical Monte-Carlo Planning
Monte-Carlo Tree Search, especially UCT and its POMDP version POMCP, have demonstrated excellent performance on many problems. However, to efficiently scale to large domains one should also exploit hierarchical structure if present. In such hierarchical domains, finding rewarded states typically requires to search deeply; covering enough such informative states very far from the root becomes co...
متن کاملHierarchical Monte Carlo Radiosity
Hierarchical radiosity and Monte Carlo radiosity are branches of radiosity research that focus on complementary problems. The synthesis of both families of radiosity algorithms has however received little attention until now. In this paper, a procedure is presented that bridges the gap. It allows any proposed hierarchical refinement strategy to be investigated in the context of an arbitrary dis...
متن کاملMove-Pruning Techniques for Monte-Carlo Go
Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers statistics on moves, and it prunes moves statistically inferior to the best one [5]. This papers yields two new pruning techniques: Miai Pruning (MP) and Set Pruning (SP). In MP the second move of the random games is selected at ran...
متن کاملHierarchical Monte Carlo Image Synthesis
A fundamental variance reduction technique for Monte Carlo integration in the framework of integro-approximation problems is presented. Using the method of dependent tests a successive hierarchical function approximation algorithm is developed, which captures discontinuities and exploits smoothness in the target function. The general mathematical scheme and its highly efficient implementation a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2015
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btv502